Regular switching components

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Boosting Ethernet using Regular Switching Hubs

CHIH-WEN HSUEH, HSIN-HUNG LIN AND GUO-CHIUAN HUANG Graduate Institute of Networking and Multimedia and Department of Computer Science and Information Engineering National Taiwan University Taipei, 106 Taiwan E-mail: [email protected] Real-Time Systems Laboratory Department of Computer Science and Information Engineering National Chung Cheng University Chiayi, 621 Taiwan E-mail: {lsh; hgc8...

متن کامل

Destroying Noncomplete Regular Components in Graph Partitions

We prove that if G is a graph and r1, . . . , rk ∈ Z≥0 such that ∑k i=1 ri ≥ ∆(G) + 2 − k then V (G) can be partitioned into sets V1, . . . , Vk such that ∆(G[Vi]) ≤ ri and G[Vi] contains no non-complete ri-regular components for each 1 ≤ i ≤ k. In particular, the vertex set of any graph G can be partitioned into ⌈ ∆(G)+2 3 ⌉ sets, each of which induces a disjoint union of triangles and paths.

متن کامل

Regular and Random Components in Aiming - PointTrajectory

The authoni examined the kinematic qualities ol Lhe aiming trajertory as related to expenise. In all. 2 phases of the trajectory were discrinrinated. The first phase was iegular approximation to the target accompanied by substantial fluctuations obeying the Webcr-Fechner law. During the first phase. shootcrs did not initiate the triggering despite any random closeness of the aiming point (AP) t...

متن کامل

Wait-free regular storage from Byzantine components

We consider the problem of implementing a wait-free regular register from storage components prone to Byzantine faults. We present a simple, efficient, and self-contained construction of such a register. Our construction utilizes a novel building block, called a 1-regular register, which can be efficiently implemented from Byzantine fault-prone components.

متن کامل

Components of competitor priming in task switching.

Executing an action in response to a stimulus is thought to result in the creation of an event code that integrates stimulus and action features (Allport, 1987; Hommel in Visual Cognition 5: 183-216, 1998). When switching between tasks, competitor priming occurs if a distractor stimulus cues the retrieval of a previously established event code in which that distractor is bound to a competing ta...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Theoretical Computer Science

سال: 2019

ISSN: 0304-3975

DOI: 10.1016/j.tcs.2019.01.010